A Chess Combination Program Which Uses Plans
نویسنده
چکیده
The program analyses carefully the initial situation. It creates some plans and tries to execute them. It analyses the situations deeper in the tree only if the plan fails. In that case it generates new plans correcting what is wrong in the old one. So, the program considers only natural branches of the tree. It can find combinations for which it is necessary to look more than twenty ply ahead. The paper describes the methods used for analyzing a situation and for modifying unsuccessful plans. Then we examine some results found by the program.
منابع مشابه
Using Patterns and Plans in Chess
The purpose of this research is to investigate the extent to which knowledge can replace and support search in selecting a chess move and to delineate the issues involved. This has been carried out by constructing a program. PARADISE (PArtern Recognition Applied to Directing SEarch), which finds the best move in tactically sharp middle game positions from the games of chess masters. It encodes ...
متن کاملUMRAO: A Chess Endgame Tutor
Most research in computer chess has focussed on creating an excellent chess player, with relatively little concern given to modelling how humans play chess. The research reported in this paper is aimed at investigating knowledge-based chess in the context of building a prototype chess tutor, UMRAO, which helps students learn how to play bishop-pawn endgames. In tutoring it is essential to take ...
متن کاملMTD(f), A Minimax Algorithm Faster Than NegaScout
MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of tournament game playing programs for chess, checkers and Othello it performed better, on average, than NegaScout/PVS (the AlphaBeta variant used in practically all good chess, checkers, and Othello programs). One of the strongest chess programs of the moment, MIT's parallel c...
متن کاملPlans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move generation to moves in certain move categories to reduce the number of moves considered by the bot significantly. Arimaa is a modern board game that can be played with a standard Chess set. However, the rules of the game a...
متن کاملThe Neural MoveMap Heuristic in Chess
The efficiency of alpha-beta search algorithms heavily depends on the order in which the moves are examined. This paper investigates a new move-ordering heuristic in chess, namely the Neural MoveMap (NMM) heuristic. The heuristic uses a neural network to estimate the likelihood of a move being the best in a certain position. The moves considered more likely to be the best are examined first. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 8 شماره
صفحات -
تاریخ انتشار 1977